Solving Extended Project Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Solving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations
Rolf H. Möhring • Andreas S. Schulz • Frederik Stork • Marc Uetz Fakultät II, Institut für Mathematik, Technische Universität Berlin, Sekr. MA 6-1, Straße des 17. Juni 136, D-10623 Berlin, Germany Sloan School of Management, E53-361, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 ILOG Deutschland GmbH, Ober-Eschbacher Straße 109, D-61352 Bad Hombu...
متن کاملSolving Scheduling Problems by
We deene a general methodology to deal with a large family of scheduling problems. We consider the case when some of the constraints are expressed through the minimization of a loss function. We study with more details a benchmark example consisting in some jigsaw puzzle problem with additional constraints. This is the occasion to discuss some algorithmic issues typical of scheduling problems, ...
متن کاملsolving resource constraint project scheduling problems using modified ant colony optimization
resource constraints project scheduling problem (rspsp) seeks proper sequence of implementation of project activities in a way that the precedence relations and different type of resource constraints are met concurrently. rcpsp tends to optimize some measurement function as make-span, cost of implementation, number of tardy tasks and etc. as rcpsp is assumed as an np-hard problem so, different ...
متن کاملsolving the resource-constrained project scheduling problems (rcpsp) using developed imperialistic competition algorithm (dica)
the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Műszaki Tudományos Közlemények
سال: 2020
ISSN: 2601-5773
DOI: 10.33894/mtk-2020.13.25